Security properties: two agents are sufficient

Security Properties: Two Agents Are Sufficient

We consider an important family of cryptographic protocols and a class of security properties which encompasses secrecy and authentication. We show that it is always sufficient to consider a bounded number of agents b (b = 2 for secrecy properties for example): if there is an attack involving n agents, then there is an attack involving at most b agents.

H . Comon − Lundh and V . Cortier Security Properties : Two Agents Are Sufficient

Computationally universal P systems without priorities: two catalysts are sufficient

The original model of P systems with symbol objects introduced by Păun was shown to be computationally universal, provided that catalysts and priorities of rules are used. By reduction via register machines Sosík and Freund proved that the priorities may be omitted from the model without loss of computational power. Freund, Oswald, and Sosík considered several variants of P systems with catalys...

Comparing Two Information Flow Security Properties

In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we define the Failure Non-deducibility on Compositions, a failure semantics version of the BNDC. The common specification language used for the comparison is the Security Process Algebra [4], an extension of CCS [8] whic...

Are 3 sentinel nodes sufficient?

HYPOTHESIS It has recently been proposed that only 3 sentinel lymph nodes (SLNs) are required for an adequate SLN biopsy. Others have advocated removing all nodes that are blue, hot, at the end of a blue lymphatic channel, or palpably suspicious or that have radioactive counts of 10% or greater of the most radioactive SLN. Our objective was to determine the false-negative rate (FNR) associated ...